A Tight Bound on the Cardinalities of Maximum Alliance-Free and Minimum Alliance-Cover Sets
نویسندگان
چکیده
A defensive k-alliance in a graph G = (V, E) is a set of vertices A ⊆ V such that for every vertex v ∈ A, the number of neighbors v has in A is at least k more than the number of neighbors it has in V − A (k is a measure of the strength of alliance). In this paper, we deal with two types of sets associated with defensive k-alliances; maximum defensive k-alliance free and minimum defensive k-alliance cover sets. Define a set X ⊆ V to be maximum defensive k-alliance free if X does not contain any defensive kalliance and is a largest such set. A set Y ⊆ V is called minimum defensive k-alliance cover if Y contains at least one vertex from each defensive kalliance and is a set of minimum cardinality satisfying this property. We present bounds on the cardinalities of maximum defensive k-alliance free and minimum defensive k-alliance cover sets.
منابع مشابه
Maximum Alliance-Free and Minimum Alliance-Cover Sets
A defensive k−alliance in a graph G = (V, E) is a set of vertices A ⊆ V such that for every vertex v ∈ A, the number of neighbors v has in A is at least k more than the number of neighbors it has in V −A (where k is the strength of defensive k−alliance). An offensive k−alliance is a set of vertices A ⊆ V such that for every vertex v ∈ ∂A, the number of neighbors v has in A is at least k more th...
متن کاملStrong Alliances in Graphs
For any simple connected graph $G=(V,E)$, a defensive alliance is a subset $S$ of $V$ satisfying the condition that every vertex $vin S$ has at most one more neighbour in $V-S$ than it has in $S$. The minimum cardinality of any defensive alliance in $G$ is called the alliance number of $G$, denoted $a(G)$. In this paper, we introduce a new type of alliance number called $k$-strong alliance numb...
متن کامل0 Fe b 20 06 Alliances versus cover and alliance free sets ∗
A defensive (offensive) k-alliance in Γ = (V,E) is a set S ⊆ V such that for every v ∈ S (v ∈ ∂S), the number of neighbors v has in S is at least k more than the number of neighbors it has in V \ S. A set X ⊆ V is defensive (offensive) k-alliance free, if for all defensive (offensive) k-alliance S, S \ X 6= ∅, i.e., X do not contain any defensive (offensive) k-alliance as a subset. A set Y ⊆ V ...
متن کاملOn global (strong) defensive alliances in some product graphs
A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G$ is the minimum cardinality of a global defensive alliance in $G$. In this article we study the global ...
متن کاملOn the global offensive alliance number of a graph
An offensive alliance in a graph Γ = (V,E) is a set of vertices S ⊂ V where for every vertex v in its boundary it holds that the majority of vertices in v’s closed neighborhood are in S. In the case of strong offensive alliance, strict majority is required. An alliance S is called global if it affects every vertex in V \S, that is, S is a dominating set of Γ. The offensive alliance number ao(Γ)...
متن کامل